ARMS: an algebraic recursive multilevel solver for general sparse linear systems
نویسندگان
چکیده
This paper presents a general preconditioning method based on a multilevel partial solution approach. The basic step in constructing the preconditioner is to separate the initial points into two subsets. The rst subset which can be termed \coarse" is obtained by using \block" independent sets, or \aggregates". Two aggregates have no coupling between them, but nodes in the same aggregate may be coupled. The nodes not in the coarse set are part of what might be called the \Fringe" set. The idea of the methods is to form the Schur complement related to the fringe set. This leads to a natural block LU factorization which can be used as a preconditioner for the system. This system is then solver recursively using as preconditioner the factorization that could be obtained from the next level. Unlike other multilevel precondi-tioners available, iterations between levels are allowed. One interesting aspect of the method is that it provides a common framework for many other techniques. Numerical experiments indicate that the method can be fairly robust.
منابع مشابه
pARMS: a parallel version of the algebraic recursive multilevel solver
A parallel version of the Algebraic Recursive Multilevel Solver (ARMS) is developed for distributed computing environments. The method adopts the general framework of distributed sparse matrices and relies on solving the resulting distributed Schur complement system. Numerical experiments are presented which compare these approaches on regularly and irregularly structured problems.
متن کاملA hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems
In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner, based on a distributed Schur complement formulation, for solving general linear systems. The novelty of the proposed method is to combine factorization techniques of both implicit and explicit type, recursive combinatorial algorithms, multilevel mechanisms and overlapping strategies to maximize...
متن کاملpARMS: A Package for the Parallel Iterative Solution of General Large Sparse Linear System ∗ User’s Guide
For many large-scale applications, solving large sparse linear systems is the most time-consuming part. The important criteria for a suitable solver include efficiency, robustness, and good parallel performance. The Parallel Algebraic Recursive Multilevel Solver (pARMS) [8] is a suite of distributed-memory iterative accelerators and preconditioners targeting the solution of general sparse linea...
متن کاملpARMS: A Package for Solving General Sparse Linear Systems on Parallel Computers
This paper presents an overview of pARMS, a package for solving sparse linear systems on parallel platforms. Preconditioners constitute the most important ingredient in the solution of linear systems arising from realistic scientific and engineering applications. The most common parallel preconditioners used for sparse linear systems adapt domain decomposition concepts to the more general frame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 9 شماره
صفحات -
تاریخ انتشار 2002